Constructing Finitely Presented Simple Groups That Contain Grigorchuk Groups
نویسندگان
چکیده
منابع مشابه
Constructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملAnalysing Finitely Presented Groups by Constructing Representations
One idea how to prove that a finitely presented group G is infinite is to construct suitable homomorphisms into infinite matrix groups. In [HoP 92] this is done by starting with a finite image H of G and solving linear equations to check whether the epimorphism onto H can be lifted to a representation whose image is an extension of a ZZ-lattice by H, thus exhibiting an infinite abelian section ...
متن کاملFinitely Presented Residually Free Groups
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...
متن کاملEmbedding Free Burnside Groups in Finitely Presented Groups
We construct an embedding of a free Burnside group B(m, n) of odd n > 2 and rank m > 1 in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented non-amenable groups without noncyclic free subgroups (which provides a finitely presented counterexample to the von Neumann problem on amenable groups). As another a...
متن کاملJsj-splittings for Finitely Presented Groups over Slender Groups
We generalize the JSJ-splitting of Rips and Sela to give decompositions of nitely presented groups which capture splittings over certain classes of small subgroups. Such classes include the class of all 2-ended groups and the class of all virtually ZZ groups. The approach, called \track zipping", is relatively elementary, and diiers from the Rips-Sela approach in that it does not rely on the th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1999
ISSN: 0021-8693
DOI: 10.1006/jabr.1999.7898